A Self-Organizing Channel Assignment Algorithm: A Cellular Learning Automata Approach

نویسندگان

  • Hamid Beigy
  • Mohammad Reza Meybodi
چکیده

Introduction of micro-cellular networks offer a potential increase in capacity of cellular networks, but they create problems in management of the cellular networks. A solution to these problems is self-organizing channel assignment algorithm with distributed control. In this paper, ''le first introduce the model of cellular learning automata in which learning automata are used to adjust the state transition probabilities of cellular automata. Then a cellular learning automata based self-organizing channel assignment algorithm is introduced. The simulation results show that the micro-cellular network can self-organize by using simple channel assignment algorithm as the network operates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cellular Learning Automata Based Dynamic Channel Assignment Algorithms

A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellular learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of channels in the whole network will be used by cells for channel assignment whereas in the thi...

متن کامل

St Reading Cellular Learning Automata Based Dynamic Channel Assignment Algorithms 5

17 A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellu-19 lar learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of of channels in the whole network will 21 be used by cells for channel assignment where...

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

A Dynamic Channel Assignment Algorithm: A Cellular Learning Automata Approach

IrUl"Odu("lioll of micro-cellular net.works offer a pot.ent.ial increa.c;e in capacity of cellular net.works, but. they nc'all' pl"ll"ll'lII~ ill III<UIaj!,I'IIIf'1II of t.he rellular lIetworks, A solut.ion to t.hese problems is self-orj!;ani7.inj!; channel a.c;sij!;nment a Il-(l 11'110111\\"ilh cli~lrihllll'd ('111111"01. III this papPI'. \\'1' firs! presellt thf' mociel of cellular learninj!;...

متن کامل

A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003